Automating Veriication by Functional Abstraction at the System Level ?

The veriication of digital circuits at higher levels of abstraction still suuers from complex and unstructured proofs. In this paper, we present a class of circuits that can be used for the implementation of arbitrary processes without shared memory. These processes communicate with each other according to a handshake protocol. We have proven general theorems to automatically derive correctness theorems for composed handshake circuits. The contribution of this paper is therefore a new design style based on handshake circuits and a highly automated approach to veriication at the system level based on functional abstraction.